From subspace clustering to full-rank matrix completion

Subspace clustering is the problem of finding a multi-subspace representation that best fits a collection of points taken from a high-dimensional space. This type of structure occurs naturally in many applications ranging from bioinformatics, image/text clustering to semi-supervised learning. The companion paper [3] shows that robust and tractable subspace clustering is possible with minimal requirements on the orientation of the subspaces and number of samples per subspace. This note summarizes a forthcoming work [1] on subspace clustering when some of the entries in the data matrix are missing. This problem may also be viewed as a generalization of standard low-rank matrix completion to cases where the matrix is of high or potentially full-rank. Synthetic and real data experiments confirm the effectiveness of these methods. 1 Problem formulation and model Consider a real-valued n ×N dimensional matrix X . We assume that the columns of X lie in a union of L unknown linear subspaces, of unknown dimensions. A small subset of the entries of such a matrix is revealed. The goal is two fold: 1) partition the columns into different clusters based on subspace of origin and approximate the underlying subspaces. 2) inpute the missing entries. Throughout we assume that the each entry ofX is observed with probability 1 − δ.